5th International Planning Competition: Non-deterministic Track Call For Participation
نویسندگان
چکیده
The 5th International Planning Competition will be colocated with ICAPS-06. This IPC edition will contain a track on nondeterministic and probabilistic planning as the continuation of the probabilistic track at IPC-4. The non-deterministic track will evaluate systems for conformant, non-deterministic and probabilistic planning under different criteria. This document describes the general goals of the track, the planning tasks to be addressed, the representation language and the evaluation methodology.
منابع مشابه
A Survey of the Seventh International Planning Competition
In this article we review the 2011 International Planning Competition. We give an overview of the history of the competition, discussing how it has developed since its first edition in 1998. The 2011 competition was run in three main separate tracks: the Deterministic (Classical) Track; the Learning Track; and the Uncertainty Track. Each track proposed its own distinct set of new challenges and...
متن کامل6th International Planning Competition: Uncertainty Part
The 6 International Planning Competition will be colocated with ICAPS-08 in Sydney, Australia. This competition will contain three parts: i) the classical part, ii) the uncertainty part and iii) the learning part. This document presents the uncertainty part and its various tracks. The official site for the uncertainty part is: http://ippc-2008.loria.fr/wiki/, where this document and other mater...
متن کاملThe deterministic part of the seventh International Planning Competition
The International Planning Competition is organized in the context of the International Conference on Automated Planning and Scheduling (ICAPS) and it is considered a reference source for the planning and scheduling community. The competition is typically organized every two years and deals with relevant issues for the community such as the definition of evaluation standards, the publication of...
متن کاملThe International Competition of Distributed and Multiagent Planners (CoDMAP)
gence, proposes possibly tractable, heuristic, and algorithmic solutions to computationally hard combinatorial problems of sequential decision making. In the case of domain-independent planning, the input of a planner does not contain only the planning problem instance but also its domain, compactly describing the mechanics of the environment. The history of competitions of domain-independent a...
متن کاملExploiting optimizations in SAT-based planning: minimal-#actions plans and “soft” goals
Planning as Satisfiability (SAT) is the best approach for optimally solving classical planning problems. The SAT-based planner SATPLAN has been the winner in the deterministic track for optimal planners in the 4th International Planning Competition (IPC-4) and the co-winner in the last 5th IPC (together with another SAT-based planner). Given a planning problem Π , SATPLAN works by (i) generatin...
متن کامل